Best Matching Theory & Applications by Mohsen Moghaddam & Shimon Y. Nof

Author:Mohsen Moghaddam & Shimon Y. Nof
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Step 2 Neighborhood search. This step includes delineation of the neighborhood for S, as well as the search procedure. This step is similar to the neighborhood search phase of GRASP (Sect. 5.3.2, Logic: Steps 5–6). x-exchange neighborhoods such as shift () and swap () are common, together with more advanced neighborhoods such as ejection chains and path relinking (see, e.g., Yagiura et al. 2006).

Step 3 Tabu time updates. After a variable leaves the solution, i.e., , it enters the tabu list, and therefore its tabu time (i.e., the number of iterations it has to spend in the tabu list) must be calculated. Naturally, the tabu time must be proportional to the cost/benefit of removing from the solution set, i.e.,

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.